A rewriting approach to satisfiability procedures
نویسندگان
چکیده
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism. 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. We exhibit a theory T1 such that satisfiability is decidable, but satisfiability in infinite models is undecidable. It follows that satisfiability in T1 ∪ T2 is undecidable, ...
متن کاملOn a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
The rewriting approach to T -satisfiability is based on establishing termination of a rewrite-based inference system for first-order logic on the T -satisfiability problem. Extending previous such results, including the quantifier-free theory of equality and the theory of arrays with or without extensionality, we prove termination for the theories of records with or without extensionality, inte...
متن کاملDeciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alone is not sufficient for many important verification applications such as program analysis. Motivated by this observation, we study extensions of the theory of arrays whose satisfiability problem (i.e. checking the satisfi...
متن کاملAutomatically finding particular term rewriting systems
Our goal is to give a list of rewriting properties, and then automatically find a term rewriting system (TRS) satisfying these properties. In earlier work we did this for finite abstract reduction systems; in this paper we extend the approach to ground term rewriting systems over constants and one unary symbol. In particular, we fully automatically find a TRS that is locally confluent but not c...
متن کاملScalable Logic Synthesis using a Simple Circuit Structure
This paper proposes a resurgence of rewriting and peephole optimization. However, instead of structural matching and rulebased synthesis used in the classical approach, the proposed local transformations rely on efficient modern techniques, such as precomputation, reconvergence analysis, cut enumeration, Boolean matching, exhaustive simulation of small logic cones, and local resource-aware deci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 183 شماره
صفحات -
تاریخ انتشار 2003